Performance evaluation of an optically interconnected “scheduling” switch network for Pareto traffic

نویسندگان

  • Kyriakos Vlachos
  • Emmanuel Varvarigos
  • Chris Bintjas
چکیده

A performance analysis of an optically interconnected packet-scheduling switch network is presented. The scheduling switch uses a branch of feed-forward delays for each input port, interconnected with elementary optical switches to resolve contention. The scheduling switch is guaranteed to be lossless under a certain smoothness property condition. We investigate the packet-loss performance of the switch when the smoothness property condition does not hold, as well as the packet delay impairments at the edge of a scheduling switch interconnected network when this property is enforced. © 2004 Optical Society of America

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Traffic-Aware Scheduling for Bluetooth Scatternets1

Bluetooth scatternet is a set of piconets interconnected via bridge devices. A good inter-piconet scheduling is necessary for the bridge devices to switch among the piconets they participated. This paper proposes an inter-piconet scheduling algorithm, Traffic-Aware Scatternet Scheduling (TASS), for bridges in bluetooth scatternets. According to the traffic information of all masters that the br...

متن کامل

A neural-network packet switch controller: scalability, performance, and network optimization

We examine a novel combination of architecture and algorithm for a packet switch controller that incorporates an experimentally implemented optically interconnected neural network. The network performs scheduling decisions based on incoming packet requests and priorities. We show how and why, by means of simulation, the move from a continuous to a discrete algorithm has improved both network pe...

متن کامل

On the Throughput Achievable by Isolated and Interconnected Input-Queueing Switches under Multiclass Traffic

Many recent studies provide an extended investigation of the maximum throughput achievable in Input-Queueing (IQ) or CombinedInput-and-Output-Queueing (CIOQ) packet switches. Some scheduling policies, among which maximum weight matching algorithms, were identified as optimal, in the sense that they were proved to achieve 100% throughput under any admissible single-class traffic pattern. Most of...

متن کامل

Minimum Delay Scheduling in Scalable Hybrid Electronic/Optical Packet Switches

A hybrid electronic/optical packet switch consists of electronically buffered line-cards interconnected by an optical switch fabric. It provides a scalable switch architecture for next generation high-speed routers. Due to the non-negligible switch reconfiguration overhead, many packet scheduling algorithms are invented to ensure performance guaranteed switching (i.e. 100% throughput with bound...

متن کامل

Static Security Constrained Generation Scheduling Using Sensitivity Characteristics of Neural Network

This paper proposes a novel approach for generation scheduling using sensitivitycharacteristic of a Security Analyzer Neural Network (SANN) for improving static securityof power system. In this paper, the potential overloading at the post contingency steadystateassociated with each line outage is proposed as a security index which is used forevaluation and enhancement of system static security....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004